An Elitist Simulated Annealing Algorithm for Solving Multi Objective Optimization Problems in Internet of Things Design
نویسنده
چکیده
*Subhamoy Chakraborti AVP – IT, Magma Fincorp Limited, India Email: [email protected] Sugata Sanyal Member, School of Computing and Informatics' "Brain Trust" University of Louisiana at Lafayette, USA [email protected] *Corresponding author --------------------------------------------------------------------ABSTRACT------------------------------------------------------------Internet of Things (IoT) is going to introduce billions of data collection and computing nodes all over the world in next few years. IoT would be impacting daily life in many ways by virtue of more granular field-level data collection via those nodes and thus delivering faster actions. One of the key challenges in IoT design decision is resource constraintwhich often limits the space, battery capacity, computing power available in each of the nodes. This presents an optimization problem with multiple objectives, with competing objectives. This paper proposes an algorithm based on Simulated annealing. Simulated Annealing is inspired by the physical annealing process which leads to a gradual movement towards a solution set. This paper proposes to use a variant of this mechanism to solve multi-objective optimization problems in IoT space to come out with a set of solutions which are nondominated from each other.
منابع مشابه
َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملA Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations
In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملAn archived multi-objective simulated annealing for a dynamic cellular manufacturing system
To design a group layout of a cellular manufacturing system (CMS) in a dynamic environment, a multi-objective mixed-integer non-linear programming model is developed. The model integrates cell formation, group layout and production planning (PP) as three interrelated decisions involved in the design of a CMS. This paper provides an extensive coverage of important manufacturing features u...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کامل